A savings based method for real-life vehicle routing problems
نویسندگان
چکیده
منابع مشابه
A Savings Based Method for Real-Life Vehicle Routing Problems
This paper describes a Savings Based algorithm for the Extended Vehicle Routing Problem. This algorithm is compared with a Sequential Insertion algorithm on reallife data. Besides the traditional quality measures such as total distance traveled and total workload, we compare the routing plans of both algorithms according to nonstandard quality measures that help to evaluate the "visual attracti...
متن کاملTools for Real-life Vehicle Routing Problems with Transshipment Par
véhicules aient la possibilité d'effectuer plusieurs arrêts sur leur route, nous proposons une heuristique d'agrégation des sites. Cela a également l'avan-tage de réduire davantage la taille du problème. Ce modèle étant résolu, nous lançons une exécution d'ILOG TPO avec les chemins d'ordres de transport figés, puis à partir de la solution finale de cette exécution, nous relançons ILOG TPO sans ...
متن کاملAn Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملthe decision support system for the resolution of real-life vehicle routing and scheduling problem
in this paper, we investigate a decision support system (dss) for the resolution of real-life vehicle routing and scheduling problem (vrsp). scheduling the deliveries from a regional distribution centre (rdc) to large stores of a major fmcg retailer includes every possible vehicle routing complexity. usual constraints that are seen are: size of the vehicle and the length of the driving day, loa...
متن کاملA new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to cover all customers while satisfying, for each route, both a capacity and a total-distance-travelled limit. Our starting point is the following refinement procedure proposed in 1981 by Sarvanov and Doroshko for the pure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2002
ISSN: 0160-5682,1476-9360
DOI: 10.1057/palgrave.jors.2601252